Path Planning with Incremental Roadmap Update for Large Environments
نویسندگان
چکیده
Recent research results suggest that one can incorporate motion-planning techniques into the control loop of 3D navigation or tele-operation for more efficient navigation. However, the motion planner with this approach may not scale up well for large workspaces. In this paper, we propose a novel approach to overcome this scalability problem. We limit the region of interest for path-finding to a window around the current robot configuration and incrementally update the roadmap in this window as the robot moves. In order to make the roadmap update efficient enough for interactive applications, we adopt a recently proposed data structure, called Rapidly-Exploring Random Tree (RRT), to reduce the run-time cost of building the connectivity roadmap. The incremental path planner has been implemented in Java and incorporated into a Java3D-based VRML browser. We compare the performance of this improved planner with the previous one for workspaces of various sizes and analyze the bottlenecks of maintaining such a roadmap. By extending the planning techniques to large workspaces, we believe that this type of intelligent navigation or tele-operation control will inspire better user-interface design and further researches in planning for large or
منابع مشابه
Sensor - Based Exploration : Incremental Construction of the Hierarchical Generalized Voronoi
This paper prescribes an incremental procedure to construct roadmaps of unknown environments. Recall that a roadmap is a geometric structure that a robot uses to plan a path between two points in an environment. If the robot knows the roadmap, then it knows the environment. Likewise, if the robot constructs the roadmap, then it has effectively explored the environment. This paper focuses on the...
متن کاملPath Planning for a Robot Manipulator based on Probabilistic Roadmap and Reinforcement Learning
The probabilistic roadmap (PRM) method, which is a popular path planning scheme, for a manipulator, can find a collision-free path by connecting the start and goal poses through a roadmap constructed by drawing random nodes in the free configuration space. PRM exhibits robust performance for static environments, but its performance is poor for dynamic environments. On the other hand, reinforcem...
متن کاملReactive Integrated Motion Planning and Execution
Current motion planners, such as the ones available in ROS MoveIt, can solve difficult motion planning problems. However, these planners are not practical in unstructured, rapidly-changing environments. First, they assume that the environment is well-known, and static during planning and execution. Second, they do not support temporal constraints, which are often important for synchronization b...
متن کاملIncremental roadmaps and global path planning in evolving industrial environments
In industrial problems both the task and environment are often very complex. Local planners are not suucient and, since tasks often involve changing the environment, global planners are limited by time constraints. This paper adopts the notion that pre-processing of the known environment, in order to generate a roadmap, can signiicantly improve on-line path planning tasks. We present results ob...
متن کاملSensor-Based Exploration: The Hierarchical Generalized Voronoi Graph
The hierarchical generalized Voronoi graph (HGVG) is a new roadmap developed for sensor-based exploration in unknown environments. This paper defines the HGVG structure: a robot can plan a path between two locations in its work space or configuration space by simply planning a path onto the HGVG, then along the HGVG, and finally from the HGVG to the goal. Since the bulk of the path planning occ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001